Location:
Search - 1024 point FFT
Search list
Description: 一个实用的1024点的FFT的dsp源程序-a practical point of the 1024 FFT dsp source
Platform: |
Size: 12461 |
Author: lin |
Hits:
Description: 将声音文件在时间轴上分割成几段，分别将段的秩序及某些段内的秩序颠倒，从而实现了对声音文件的加密。首先，先读取一个声音信号，对信号做1024点FFT变换，取完点之后，分成四个向量，四个向量组成一个矩阵，再对每一个向量进行转置，再重新整合，从而就实现了回密的过程。-Sound files on the timeline will be divided into paragraphs, each paragraph of the order and reversed the order of some paragraphs to realize the encryption of sound files. First, the first reading of a voice signal, the signal was 1024 points FFT transform, check after the completion point, divided into four vectors, the four vectors form a matrix, then for each vector transpose, re-integration, which will achieve a return to close the process.
Platform: |
Size: 33792 |
Author: yuanyuan |
Hits:
Description: 本程序实现了定点1024点FFT，根据溢出位数进行动态Q值调整-This procedure implements fixed-point 1024 points FFT, according to the median overflow dynamically adjust the Q value
Platform: |
Size: 231424 |
Author: 于慕阳 |
Hits:
Description: 1024点基2时分FFT快速傅立叶变换(vhdl)
-1024-point radix-2 FFT Fast Fourier transform peak (vhdl)
Platform: |
Size: 617472 |
Author: leo |
Hits:
Description: this module C that I wrote for FFT radix 2-2 1024 point.-this is module C that I wrote for FFT radix 2-2 1024 point.
Platform: |
Size: 37888 |
Author: Pon |
Hits:
Description: 在单片中实现的1024点的FFT运算，算法的实现是采用1024点的查表发。-Implemented in 1024 in a single point FFT computation, the algorithm implementation is made with 1024 points in the look-up table.
Platform: |
Size: 5120 |
Author: yinxiong |
Hits:
Description: 用verilog编写的1024点的fft快速傅立叶变换-Written in 1024 by verilog point fast Fourier transform fft
Platform: |
Size: 12288 |
Author: yangyang |
Hits:
Description: FFT的奈奎斯特频率为 ，（ 为采样间隔）实际上的FFT变换点数要求为2的n次幂，各点所对应的频率是从 到 ，求出 后，可以用 ，这里N为FFT变换的点数。如变换点数为2048，由于对称性，实际有用的点数为1024个。
在该程序中，做完富氏变换后，已经将数据按照频率从0到 到0的顺序排好。
在运行结果中，只需存储左下角的1/4区域的数据即可。
-FFT of the Nyquist frequency, (for the sampling interval) is actually the FFT, the n number of points required for the power of 2, the frequency corresponding to each point is to, find, you can use the FFT, where N points. Such as the transformation point to 2048, due to the symmetry, the actual useful points to 1024. In the process, done after the Fourier transform has the data in accordance with the frequency range from 0 to 0 in order to line up. In the run results, only the lower left corner of the store 1/4 of regional data can be.
Platform: |
Size: 153600 |
Author: |
Hits:
Description: 2dFFT的奈奎斯特频率为 ，（ 为采样间隔）实际上的FFT变换点数要求为2的n次幂，各点所对应的频率是从 到 ，求出 后，可以用 ，这里N为FFT变换的点数。如变换点数为2048，由于对称性，实际有用的点数为1024个。
在该程序中，做完富氏变换后，已经将数据按照频率从0到 到0的顺序排好。
在运行结果中，只需存储左下角的1/4区域的数据即可。
-2dFFT of the Nyquist frequency, (for the sampling interval) is actually the FFT, the n number of points required for the power of 2, the frequency corresponding to each point is to, find, you can use the FFT, where N points. Such as the transformation point to 2048, due to the symmetry, the actual useful points to 1024. In the process, done after the Fourier transform has the data in accordance with the frequency range from 0 to 0 in order to line up. In the run results, only the lower left corner of the store 1/4 of regional data can be.
Platform: |
Size: 525312 |
Author: |
Hits:
Description: 不定点的fft算法，当前可选择64,128,256,512,1024个点数，可自行添加其他-The fft algorithm is not fixed, the current choice 64,128,256,512,1024 one point, they are free to add other
Platform: |
Size: 1024 |
Author: shenxian |
Hits:
Description: 基-2的1024点FFT算法，并与理论FFT结果比较，改程序是正确的.-1024-point radix-2 FFT algorithm, and compared with the theoretical results of the FFT, to change the program is correct.
Platform: |
Size: 1024 |
Author: 路程程 |
Hits:
Description: STM32 64 256 1024采集点的FFT算法结果作用意义!-STM32 64 256 1024 collection point FFT algorithm result role sense!
Platform: |
Size: 19456 |
Author: justy lee |
Hits:
Description: FFT n point 4096 1024 -FFT n point 4096 1024 ...
Platform: |
Size: 25600 |
Author: Zero |
Hits:
Description: Xilinx的1024点傅里叶分析，内有详细说明-The xFFT1024 fast Fourier transform (FFT) Core computes a 1024-point complex FFT. The input
data is a vector of 1024 complex values represented as 16-bit 2’s complement numbers – 16-bits
for each of the real and imaginary component of a datum
Platform: |
Size: 700416 |
Author: 我是谁 |
Hits: